Not a Piece of Cake – What Makes Online Communities Work?
نویسنده
چکیده
منابع مشابه
The Price of Indivisibility in Cake Cutting
We consider the problem of envy-free cake cutting, which is the distribution of a continuous heterogeneous resource among self interested players such that nobody prefers what somebody else receives to what they get. Existing work has focused on two distinct classes of solutions to this problem allocations which give each player a continuous piece of cake and allocations which give each player ...
متن کاملBetterWays to Cut a Cake
I n this paper we show how mathematics can illuminate the study of cake-cutting in ways that have practical implications. Specifically, we analyze cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n people), where a cake is a metaphor for a heterogeneous, divisible good, whose parts may be valued differently by different people. These algorithms not only establish th...
متن کاملOBSERVATION Prediction During Language Processing is a Piece of Cake — But Only for Skilled Producers
Are there individual differences in children’s prediction of upcoming linguistic input and what do these differences reflect? Using a variant of the preferential looking paradigm (Golinkoff, Hirsh-Pasek, Cauley, & Gordon, 1987), we found that, upon hearing a sentence like, “The boy eats a big cake,” 2-year-olds fixate edible objects in a visual scene (a cake) soon after they hear the semantical...
متن کاملPrediction during language processing is a piece of cake--but only for skilled producers.
Are there individual differences in children's prediction of upcoming linguistic input and what do these differences reflect? Using a variant of the preferential looking paradigm (Golinkoff, Hirsh-Pasek, Cauley, & Gordon, 1987), we found that, upon hearing a sentence like, "The boy eats a big cake," 2-year-olds fixate edible objects in a visual scene (a cake) soon after they hear the semantical...
متن کاملN-person Envy-free Chore Division
In this paper we consider the problem of chore division, which is closely related to a classical question, due to Steinhaus [7], of how to cut a cake fairly. We focus on constructive solutions, i.e., those obtained via a well-defined procedure or algorithm. Among the many notions of fairness is envy-freeness: an envy-free cake division is a set of cuts and an allocation of the pieces that gives...
متن کامل